Finite-automaton aperiodicity is PSPACE-complete
نویسندگان
چکیده
منابع مشابه
Aperiodicity of Rational Functions Is PSPACE-Complete
It is known that a language of finite words is definable in monadic second-order logic – MSO – (resp. first-order logic – FO –) iff it is recognized by some finite automaton (resp. some aperiodic finite automaton). Deciding whether an automaton A is equivalent to an aperiodic one is known to be PSPACE-complete. This problem has an important application in logic: it allows one to decide whether ...
متن کاملModel Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a symbolic representation of an interleaved reachability graph. We show that model checking a fixed size formula of several temporal logics, including LTL, CTL, and CTL∗, is PSPACE-complete in the size of a finite complete...
متن کاملLemmings Is PSPACE-Complete
Lemmings is a computer puzzle game developed by DMA Design and published by Psygnosis in 1991, in which the player has to guide a tribe of lemming creatures to safety through a hazardous landscape, by assigning them specific skills that modify their behavior in different ways. In this paper we study the optimization problem of saving the highest number of lemmings in a given landscape with a gi...
متن کاملScrabble Is PSPACE-Complete
In this paper we study the computational complexity of the game of Scrabble. We prove the PSPACEcompleteness of a derandomized model of the game, answering an open question of Erik Demaine and Robert Hearn.
متن کاملAmazons is PSPACE-complete
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro [2] showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that deciding the outcome of an n×n Amazon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1991
ISSN: 0304-3975
DOI: 10.1016/0304-3975(91)90075-d